Drawing Graphs Within Graphs: A Contribution to the Graph Drawing Contest
نویسندگان
چکیده
This paper is a winning contribution to the Graph Drawing Contest 2003. The task of drawing subgraphs is often underestimated and subgraphs are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that layouts the subgraphs first and therefore increases their locality. We introduce connection sets emphasizing relationships between several subgraphs. In a case study, we demonstrate how they can be used to visualize connections between many small network motifs. H/Z/G, Drawing Graphs Within Graphs, JGAA, vol. 0, no. 0, 0000 2
منابع مشابه
Drawing Graphs Within Graphs
The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they ca...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملDynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of the 1998 Graph Drawing Contest and constitutes a customized blend of techniques known from the Graph Drawing literature. Since we feel that they may be of interest to others facing similar graph drawing problems, some ...
متن کاملDrawing Graphs on Few Lines and Few Planes
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections to other challenging graph-drawing problems such as small-area or small-volume drawings, layered or track drawings, and drawing graphs with low visual complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003